Comment on"Semiquantum secret sharing using entangled states"
نویسندگان
چکیده
Recently, Li et al. [Phys. Rev. A, 82(2), 022303] presented two semi-quantum secret sharing (SQSS) protocols using GHZ-like states. The proposed schemes are rather practical because only the secret dealer requires to equip with advanced quantum devices such as quantum memory, whereas the other agents can merely perform classical operations to complete the secret sharing. However, this study points out that a security pitfall exists in the eavesdropping check phase of both schemes that could mount to an Intercept-resend attack and a Trojan horse attack on the two schemes, respectively, to disclose the other agent’s shadow, and further to reveal the master key of the SQSS, which contradicts to the security requirement of a QSS. Fortunately, two possible solutions are proposed to avoid this security pitfall. keywords: Quantum secret sharing, GHZ-like state, Intercept-resend attack, Trojan horse attack
منابع مشابه
Quantum secret sharing with classical Bobs
Boyer, Kenigsberg, and Mor [Phys.Rev.Lett.99, 140501(2007)] proposed a novel idea of semi-quantum key distribution where a key can be securely distributed between Alice who can perform any quantum operation and Bob who is classical. Extending the idea of “semiquantum” to other tasks of quantum information processing is of interest and worth considering. In this article, we consider the issue of...
متن کاملQuantum secret sharing based on a reusable Greenberger - Horne - Zeilinger states as secure carriers ”
We show that the criticism of a recent comment [1] on the insecurity of a quantum secret sharing protocol proposed in [2] is based on a misconception about the meaning of security and hence is invalid. The same misconception also appears in another comment of the authors [3] on the security of an entangled-based quantum key distribution protocol [4, 5].
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملSequential quantum secret sharing in noisy environments
Sequential Quantum Secret Sharing schemes (QSS) do not use entangled states for secret sharing, rather they rely on sequential operations of the players on a single state which is circulated between the players. In order to check the viability of these schemes under imperfect operations and noise in the channels, we consider one such scheme in detail and show that under moderate conditions it i...
متن کاملQuantum secret sharing based on local distinguishability
In this paper we analyze the (im)possibility of the exact distinguishability of orthogonal multipartite entangled states under restricted local operation and classical communication. Based on this local distinguishability analysis we propose a new scheme for quantum secret sharing (QSS). Our QSS scheme is quite general and cost efficient compared to other schemes. In our scheme no joint quantum...
متن کامل